The approximate inverse in action III: 3D-Doppler tomography
نویسندگان
چکیده
منابع مشابه
The approximate inverse in action III: 3D-Doppler tomography
The approximate inverse is a powerful tool for solving first kind operator equations in a stable way. Its abstract convergence and stability theory developed in our articles [SIAM J. Numer. Anal., 37, 1909-1929,2000] and [Math. Comp., 72, 1399-1415, 2003] is applied to the reconstruction problem of 3D-vector field tomography resulting in a reconstruction algorithm of filtered backprojection typ...
متن کاملThe Approximate Inverse in Action with an Application to Computerized Tomography
The approximate inverse is a scheme to obtain stable numerical inversion formull for linear operator equations of the rst kind. Yet, in some applications the computation of a crucial ingredient, the reconstruction kernel, is time-consuming and instable. It may even happen that the kernel does not exist for a particular semi-discrete system. To cure this dilemma we propose and analyze a techniqu...
متن کاملThe approximate inverse in action II: convergence and stability
The approximate inverse is a scheme for constructing stable inversion formulas for operator equations. Originally, it is defined on L2-spaces. In the present article we extend the concept of approximate inverse to more general settings which allow us to investigate the discrete version of the approximate inverse which actually underlies numerical computations. Indeed, we show convergence if the...
متن کاملThe Approximate Inverse in Action IV: Semi-Discrete Equations in a Banach Space Setting
This article concernes the method of approximate inverse to solve semi-discrete, linear operator equations in Banach spaces. Semi-discrete means that we search a solution in an infinite dimensional Banach space having only a finite number of data available. In this sense the situation is applicalble to a large variety of applications where a measurement process delivers a discretization of an i...
متن کاملRefining an Approximate Inverse
Direct methods have made remarkable progress in the computational efficiency of factorization algorithms during the last three decades. The advances in graph theoretic algorithms have not received enough attention from the iterative methods community. For example, we demonstrate how symbolic factorization algorithms from direct methods can accelerate the computation of a factored approximate in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2004
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-003-0512-7